Auto-WEKA 2.0: Automatic model selection and hyperparameter optimization in WEKA

Article / Letter to editorLeiden Inst Advanced Computer Science

The Effectiveness of Co-Determination Laws in Cooperative and Adversarial Employment Relations: When Does Regulation Have Bite?

The German Codetermination Law grants workers of establishments with 200 or more employees the right to have a works councillor who is fully exempted from his or her regular job duties while still paid a regular salary. This article analyses theoretically and empirically how this de jure right to exemption translates into de facto practice, and explicitly takes into account the nature of the employment relations participation regime. It is found that the right of exemption has no effect in cooperative employment relations because exemptions are granted even in the absence of legal rights, but does make a difference in adversarial relations when exemptions are only granted above the threshold where legal rights force employers to do so, i.e. legal rights do make a decisive difference in exactly those situations where the legislators’ intent would not be realized without the right to legal enforcemen

Shaping electron wave functions in a carbon nanotube with a parallel magnetic field

A magnetic field, through its vector potential, usually causes measurable changes in the electron wave function only in the direction transverse to the field. Here we demonstrate experimentally and theoretically that in carbon nanotube quantum dots, combining cylindrical topology and bipartite hexagonal lattice, a magnetic field along the nanotube axis impacts also the longitudinal profile of the electronic states. With the high (up to 17T) magnetic fields in our experiment the wave functions can be tuned all the way from "half-wave resonator" shape, with nodes at both ends, to "quarter-wave resonator" shape, with an antinode at one end. This in turn causes a distinct dependence of the conductance on the magnetic field. Our results demonstrate a new strategy for the control of wave functions using magnetic fields in quantum systems with nontrivial lattice and topology.Comment: 5 figure

Auto-WEKA 2.0: Automatic model selection and hyperparameter optimization in WEKA

Algorithms and the Foundations of Software technolog

Stability of Mine Car Motion in Curves of Invariable and Variable Radii

We discuss our experiences adapting three recent algorithms for maximum common (connected) subgraph problems to exploit multi-core parallelism. These algorithms do not easily lend themselves to parallel search, as the search trees are extremely irregular, making balanced work distribution hard, and runtimes are very sensitive to value-ordering heuristic behaviour. Nonetheless, our results show that each algorithm can be parallelised successfully, with the threaded algorithms we create being clearly better than the sequential ones. We then look in more detail at the results, and discuss how speedups should be measured for this kind of algorithm. Because of the difficulty in quantifying an average speedup when so-called anomalous speedups (superlinear and sublinear) are common, we propose a new measure called aggregate speedup

Experimental Evaluation of Subgraph Isomorphism Solvers

International audienceSubgraph Isomorphism (SI) is an NP-complete problem which is at the heart of many structural pattern recognition tasks as it involves finding a copy of a pattern graph into a target graph. In the pattern recognition community, the most well-known SI solvers are VF2, VF3, and RI. SI is also widely studied in the constraint programming community, and many constraint-based SI solvers have been proposed since Ullman, such as LAD and Glasgow, for example. All these SI solvers can solve very quickly some large SI instances, that involve graphs with thousands of nodes. However, McCreesh et al. have recently shown how to randomly generate SI instances the hardness of which can be controlled and predicted, and they have built small instances which are computationally challenging for all solvers. They have also shown that some small instances, which are predicted to be easy and are easily solved by constraint-based solvers, appear to be challenging for VF2 and VF3. In this paper, we widen this study by considering a large test suite coming from eight benchmarks. We show that, as expected for an NP-complete problem, the solving time of an instance does not depend on its size, and that some small instances coming from real applications are not solved by any of the considered solvers. We also show that, if RI and VF3 can solve very quickly a large number of easy instances, for which Glasgow or LAD need more time, they fail at solving some other instances that are quickly solved by Glasgow or LAD, and they are clearly outperformed by Glasgow on hard instances. Finally, we show that we can easily combine solvers to take benefit of their complementarity

SUNNY-CP : a Sequential CP Portfolio Solver

International audienceThe Constraint Programming (CP) paradigm allows to model and solve Constraint Satisfaction / Optimization Problems (CSPs / COPs). A CP Portfolio Solver is a particular constraint solver that takes advantage of a portfolio of different CP solvers in order to solve a given problem by properly exploiting Algorithm Selection techniques. In this work we present sunny-cp: a CP portfolio for solving both CSPs and COPs that turned out to be competitive also in the MiniZinc Challenge, the reference competition for CP solvers

What’s a box of “Bakewell Tarts” got to do with it? Performing gender as a judicial virtue in the theatre of justice

On a July morning in 2013 a box of a popular English branded confection called“Cherry Bakewells’ appeared in the court of the Lord Chief Justice of England and Wales. It generated much laughter. The event was the swearing in ceremony for Dame Julia Wendy Macur as a judge of the Court of Appeal. If her appointment was a cause for celebration, the backdrop to the event was the serious business of judicial renewal and the gender composition of the judiciary. Neither topic is a laughing matter. Drawing upon data generated through the observation of 18 swearing in events this chapter uses the gender/humour interface to examine the gender dynamics of the social world of the judiciary as an institution. Keywords: ceremonial archive, gender, judicial diversity, wi

Marine resource abundance drove pre-agricultural population increase in Stone Age Scandinavia

How climate and ecology affect key cultural transformations remains debated in the context of long-term socio-cultural development because of spatially and temporally disjunct climate and archaeological records. The introduction of agriculture triggered a major population increase across Europe. However, in Southern Scandinavia it was preceded by ~500 years of sustained population growth. Here we show that this growth was driven by long-term enhanced marine production conditioned by the Holocene Thermal Maximum, a time of elevated temperature, sea level and salinity across coastal waters. We identify two periods of increased marine production across trophic levels (P1 7600–7100 and P2 6400–5900 cal. yr BP) that coincide with markedly increased mollusc collection and accumulation of shell middens, indicating greater marine resource availability. Between ~7600–5900 BP, intense exploitation of a warmer, more productive marine environment by Mesolithic hunter-gatherers drove cultural development, including maritime technological innovation, and from ca. 6400–5900 BP, underpinned a ~four-fold human population growth

Sequential and parallel solution-biased search for subgraph algorithms

Funding: This work was supported by the Engineering and Physical Sciences Research Council (grant numbers EP/P026842/1, EP/M508056/1, and EP/N007565).The current state of the art in subgraph isomorphism solving involves using degree as a value-ordering heuristic to direct backtracking search. Such a search makes a heavy commitment to the first branching choice, which is often incorrect. To mitigate this, we introduce and evaluate a new approach, which we call “solution-biased search”. By combining a slightly-random value-ordering heuristic, rapid restarts, and nogood recording, we design an algorithm which instead uses degree to direct the proportion of search effort spent in different subproblems. This increases performance by two orders of magnitude on satisfiable instances, whilst not affecting performance on unsatisfiable instances. This algorithm can also be parallelised in a very simple but effective way: across both satisfiable and unsatisfiable instances, we get a further speedup of over thirty from thirty-six cores, and over one hundred from ten distributed-memory hosts. Finally, we show that solution-biased search is also suitable for optimisation problems, by using it to improve two maximum common induced subgraph algorithms.Postprin